Distance-regular graphs without 4-claws
نویسنده
چکیده
We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.
منابع مشابه
The 13th Japan-Korea Workshop on Algebra and Combinatorics
January 29th (Thu) at Multipurpose Hall in Nakamura Centenary Memorial Hall Opening Speech Makoto Tagami 10:00 – 10:45 Sejeong Bang (Yeungnam University) Distance-regular graphs without 4-claws 11:00 – 11:45 Jae-Ho Lee (Tohoku University) Nonsymmetric Askey-Wilson polynomials and Q-polynomial distance-regular graphs 13:30 – 14:15 Gary Greaves (Tohoku University) Eigenvalues of symmetric matrice...
متن کاملLinear Algebra Techniques in Combinatorics & Graph Theory ( 11 w 5033 ) Jan . 30
S (in alphabetic order by speaker surname) Title: Geometric distance-regular graphs without 4-claws Speaker: Sejeong Bang, Seoul National University Abstract: A non-complete distance-regular graph Γ is called geometric if there exists a set C of Delsarte cliques such that each edge of Γ lies in a unique clique in C. In this talk, we determine the non-complete distance-regular graphs satisfying ...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملRandom 4-regular graphs have claw-decompositions asymptotically almost surely
In 2006, Barát and Thomassen conjectured that the edges of every planar 4-regular 4-edgeconnected graph can be decomposed into claws. Shortly afterward, Lai constructed a counterexample to this conjecture. Using the small subgraph conditioning method of Robinson and Wormald, we find that a random 4-regular graph has a claw-decomposition asymptotically almost surely, provided that the number of ...
متن کاملDistance-regular Cayley graphs with least eigenvalue -2
We classify the distance-regular Cayley graphs with least eigenvalue −2 and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain projective planes. In addition, we classify the possible connection sets for the lattice graphs and obtain some results on the structure of distance-regular C...
متن کامل